A Universal Slope Set for 1-Bend Planar Drawings

We describe a set of ∆−1 slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree ∆ ≥ 4; this establishes a new upper bound of ∆− 1 on the 1-bend planar slope number. By universal we mean that every planar graph of degree ∆ has a planar drawing with at most one bend per edge and such that the slopes of the segments forming the edges belong to the given set of slopes. This improves over previous results in two ways: Firstly, the best previously known upper bound for the 1-bend planar slope number was 3 2 (∆− 1) (the known lower bound being 4 (∆ − 1)); secondly, all the known algorithms to construct 1-bend planar drawings with O(∆) slopes use a different set of slopes for each graph and can have bad angular resolution, while our algorithm uses a universal set of slopes, which also guarantees that the minimum angle between any two edges incident to a vertex is π (∆−1) . 1998 ACM Subject Classification G.2.1 Combinatorics, G.2.2 Graph Theory